A Parallel Two-Level Hybrid Method for Diagonal Dominant Tridiagonal Systems
نویسندگان
چکیده
A new method, namely the Parallel Two-Level Hybrid (PTH) method, is developed to solve tridiagonal systems on parallel computers. PTH is designed based on Parallel Diagonal Dominant (PDD) algorithm. Like PDD, PTH is highly scalable. It provides accurate solutions when PDD may not be applicable and maintains a near PDD performance when the underlying machine ensemble size is large. By controlling its two-level partition, PTH can deliver optimal performance for different machine ensemble and problem sizes. Theoretical analyses and numerical experiments indicate that PTH is significantly better than existing methods for many scientific and engineering applications.
منابع مشابه
Application and Accuracy of the Parallel Diagonal Dominant Algorithm
The Parallel Diagonal Dominant (PDD) algorithm is an eecient tridiagonal solver. In this paper, a detailed study of the PDD algorithm is given. First the PDD algorithm is extended to solve periodic tridiagonal systems and its scalability is studied. Then the reduced PDD algorithm, which has a smaller operation count than that of the conventional sequential algorithm for many applications, is pr...
متن کاملA Fast Parallel Tridiagonal Algorithm for a Class of CFD Applications
The parallel diagonal dominant (PDD) algorithm is an efficient tridiagonal solver. This paper presents for study a variation of the PDD algorithm, the reduced PDD algorithm. The new algorithm maintains the minimum communication provided by the PDD algorithm, but has a reduced operation count. The PDD algorithm also has a smaller operation count than the conventional sequential algorithm for man...
متن کاملSome aspects of the cyclic reduction algorithm for block tridiagonal linear systems
The solution of a general block tridiagonal linear system by a cyclic odd-even reduction algorithm is considered. Under conditions of diagonal dominance, norms describing the off-diagonal blocks relative to the diagonal blocks decrease quadratically with each reduction. This allows early termination of the reduction when an approximate solution is desired. The algorithm is well-suited for paral...
متن کاملInterface Splitting Algorithm for diagonal dominant tridiagonal matrices
The interface-splitting algorithm solving diagonal dominant tridiagonal systems in parallel is presented. The algorithm requires only the nearest neighbor communication with minimum number of communications and data transfer. Unlike the existing divide and conquer algorithms solving this problem, the proposed algorithm only requires one phase of synchronisation and bidirectional links can be fu...
متن کاملBackward Error Analysis of Cyclic Reduction for the Solution of Tridiagonal Systems
Tridiagonal systems play a fundamental role in matrix computation. In particular, in recent years parallel algorithms for the solution of tridiagonal systems have been developed. Among these, the cyclic reduction algorithm is particularly interesting. Here the stability of the cyclic reduction method is studied under the assumption of diagonal dominance. A backward error analysis is made, yield...
متن کامل